Fast and accurate computation of normalized Bargmann transform
نویسندگان
چکیده
منابع مشابه
Fast Computation of Normalized Edit Distances
The Normalized Edit Distance (NED) between two strings X and Y is defined as the minimum quotient between the sum of weights of the edit operations required to transform X into Y and the length of the editing path corresponding to these operations. An algorithm for computing the NED has recently been introduced by Marzal and Vidal that exhibits O(mn2) computing complexity, where m and n are the...
متن کاملGeneralizations of the Bargmann Transform
We present a new way of obtaining the Bargmann transform between L 2 (R n) and the Fock space F = F(C n) via a simple restriction principle applied to holo-morphic functions. This same principle also recovers the transform between functions on a compact Lie group and holomorphic functions on its complexii-cation studied by Gross, Hall, Hijab et al., see 1] and 2], and it gives in a similar way ...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملFast 3D Hough Transform Computation
We present a three-dimensional generalization of linear Hough transform allowing fast calculating of sums along all planes in discretized space. The main idea of this method is multiple calculation of two-dimensional fast Hough transforms combined with a specific method for plane parametrization. Compared to the direct summation, the method achieves significant acceleration ( O(n log n) vs O(n)...
متن کاملFast and Accurate Polar Fourier Transform
In a wide range of applied problems of 2-D and 3-D imaging a continuous formulation of the problem places great emphasis on obtaining and manipulating the Fourier transform in Polar coordinates. However, the translation of continuum ideas into practical work with data sampled on a Cartesian grid is problematic. In this article we develop a fast high accuracy Polar FFT. For a given two-dimension...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Optical Society of America A
سال: 2016
ISSN: 1084-7529,1520-8532
DOI: 10.1364/josaa.34.000018